\hypertarget{minqueue__test_8h}{}\section{src/queue\+\_\+algorithms/min\+\_\+queue/minqueue\+\_\+test.h File Reference}
\label{minqueue__test_8h}\index{src/queue\+\_\+algorithms/min\+\_\+queue/minqueue\+\_\+test.\+h@{src/queue\+\_\+algorithms/min\+\_\+queue/minqueue\+\_\+test.\+h}}
{\ttfamily \#include \char`\"{}src/google\+\_\+test/gtest.\+h\char`\"{}}\\*
{\ttfamily \#include \char`\"{}minqueue.\+h\char`\"{}}\\*
\subsection*{Classes}
\begin{DoxyCompactItemize}
\item 
struct \hyperlink{struct_node}{Node}
\begin{DoxyCompactList}\small\item\em \hyperlink{struct_node}{Node}\+:用于测试的类型 \end{DoxyCompactList}\item 
class \hyperlink{class_min_queue_test}{Min\+Queue\+Test}
\begin{DoxyCompactList}\small\item\em \hyperlink{class_min_queue_test}{Min\+Queue\+Test}\+:测试类，用于为测试提供基础数据 \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Namespaces}
\begin{DoxyCompactItemize}
\item 
 \hyperlink{namespaceanonymous__namespace_02minqueue__test_8h_03}{anonymous\+\_\+namespace\{minqueue\+\_\+test.\+h\}}
\end{DoxyCompactItemize}
\subsection*{Functions}
\begin{DoxyCompactItemize}
\item 
\hyperlink{minqueue__test_8h_a7d7e9ad0b2c53dda93300e9da2009fd0}{T\+E\+S\+T\+\_\+\+F} (\hyperlink{class_min_queue_test}{Min\+Queue\+Test}, test\+\_\+min)
\begin{DoxyCompactList}\small\item\em \hyperlink{class_min_queue_test}{Min\+Queue\+Test}\+:测试最小优先级队列 \end{DoxyCompactList}\item 
\hyperlink{minqueue__test_8h_a23b427e2a4b19b649fe2470df53d129b}{T\+E\+S\+T\+\_\+\+F} (\hyperlink{class_min_queue_test}{Min\+Queue\+Test}, test\+\_\+extract\+\_\+min)
\begin{DoxyCompactList}\small\item\em \hyperlink{class_min_queue_test}{Min\+Queue\+Test}\+:测试最小优先级队列 \end{DoxyCompactList}\item 
\hyperlink{minqueue__test_8h_ad8f979c4a970d6da46dce5fc51ad9be0}{T\+E\+S\+T\+\_\+\+F} (\hyperlink{class_min_queue_test}{Min\+Queue\+Test}, test\+\_\+insert)
\begin{DoxyCompactList}\small\item\em \hyperlink{class_min_queue_test}{Min\+Queue\+Test}\+:测试最小优先级队列 \end{DoxyCompactList}\item 
\hyperlink{minqueue__test_8h_abb112e00f9190db01bd4a0f1b5b0a614}{T\+E\+S\+T\+\_\+\+F} (\hyperlink{class_min_queue_test}{Min\+Queue\+Test}, test\+\_\+is\+\_\+empty)
\begin{DoxyCompactList}\small\item\em \hyperlink{class_min_queue_test}{Min\+Queue\+Test}\+:测试最小优先级队列 \end{DoxyCompactList}\item 
\hyperlink{minqueue__test_8h_a0d1b31cc45a5c0bc93e1af85b15972bb}{T\+E\+S\+T\+\_\+\+F} (\hyperlink{class_min_queue_test}{Min\+Queue\+Test}, test\+\_\+index\+\_\+inqueue)
\begin{DoxyCompactList}\small\item\em \hyperlink{class_min_queue_test}{Min\+Queue\+Test}\+:测试最小优先级队列 \end{DoxyCompactList}\item 
\hyperlink{minqueue__test_8h_aef5f2ca4ac17ec851b45200adfeb46ec}{T\+E\+S\+T\+\_\+\+F} (\hyperlink{class_min_queue_test}{Min\+Queue\+Test}, test\+\_\+decreate\+\_\+key)
\begin{DoxyCompactList}\small\item\em \hyperlink{class_min_queue_test}{Min\+Queue\+Test}\+:测试最小优先级队列 \end{DoxyCompactList}\item 
\hyperlink{minqueue__test_8h_a06d0f0b537e5e33c402fd59bdc22a40e}{T\+E\+S\+T\+\_\+\+F} (\hyperlink{class_min_queue_test}{Min\+Queue\+Test}, test\+\_\+setup\+Heap)
\begin{DoxyCompactList}\small\item\em \hyperlink{class_min_queue_test}{Min\+Queue\+Test}\+:测试最小优先级队列 \end{DoxyCompactList}\item 
\hyperlink{minqueue__test_8h_a90ff801f1417c5ee3336bb73ded2f7f2}{T\+E\+S\+T\+\_\+\+F} (\hyperlink{class_min_queue_test}{Min\+Queue\+Test}, test\+\_\+heapify)
\begin{DoxyCompactList}\small\item\em \hyperlink{class_min_queue_test}{Min\+Queue\+Test}\+:测试最小优先级队列 \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Variables}
\begin{DoxyCompactItemize}
\item 
const int \hyperlink{namespaceanonymous__namespace_02minqueue__test_8h_03_abe2fd10b52615354013b4d2480133959}{anonymous\+\_\+namespace\{minqueue\+\_\+test.\+h\}\+::\+Q\+\_\+\+N\+U\+M} =10
\end{DoxyCompactItemize}


\subsection{Function Documentation}
\hypertarget{minqueue__test_8h_a7d7e9ad0b2c53dda93300e9da2009fd0}{}\index{minqueue\+\_\+test.\+h@{minqueue\+\_\+test.\+h}!T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}}
\index{T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}!minqueue\+\_\+test.\+h@{minqueue\+\_\+test.\+h}}
\subsubsection[{T\+E\+S\+T\+\_\+\+F(\+Min\+Queue\+Test, test\+\_\+min)}]{\setlength{\rightskip}{0pt plus 5cm}T\+E\+S\+T\+\_\+\+F (
\begin{DoxyParamCaption}
\item[{{\bf Min\+Queue\+Test}}]{, }
\item[{test\+\_\+min}]{}
\end{DoxyParamCaption}
)}\label{minqueue__test_8h_a7d7e9ad0b2c53dda93300e9da2009fd0}


\hyperlink{class_min_queue_test}{Min\+Queue\+Test}\+:测试最小优先级队列 

{\ttfamily test\+\_\+min}：测试{\ttfamily min()}成员方法 

Definition at line 72 of file minqueue\+\_\+test.\+h.

\hypertarget{minqueue__test_8h_a23b427e2a4b19b649fe2470df53d129b}{}\index{minqueue\+\_\+test.\+h@{minqueue\+\_\+test.\+h}!T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}}
\index{T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}!minqueue\+\_\+test.\+h@{minqueue\+\_\+test.\+h}}
\subsubsection[{T\+E\+S\+T\+\_\+\+F(\+Min\+Queue\+Test, test\+\_\+extract\+\_\+min)}]{\setlength{\rightskip}{0pt plus 5cm}T\+E\+S\+T\+\_\+\+F (
\begin{DoxyParamCaption}
\item[{{\bf Min\+Queue\+Test}}]{, }
\item[{test\+\_\+extract\+\_\+min}]{}
\end{DoxyParamCaption}
)}\label{minqueue__test_8h_a23b427e2a4b19b649fe2470df53d129b}


\hyperlink{class_min_queue_test}{Min\+Queue\+Test}\+:测试最小优先级队列 

{\ttfamily test\+\_\+extract\+\_\+min}：测试{\ttfamily extract\+\_\+min()}成员方法 

Definition at line 82 of file minqueue\+\_\+test.\+h.

\hypertarget{minqueue__test_8h_ad8f979c4a970d6da46dce5fc51ad9be0}{}\index{minqueue\+\_\+test.\+h@{minqueue\+\_\+test.\+h}!T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}}
\index{T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}!minqueue\+\_\+test.\+h@{minqueue\+\_\+test.\+h}}
\subsubsection[{T\+E\+S\+T\+\_\+\+F(\+Min\+Queue\+Test, test\+\_\+insert)}]{\setlength{\rightskip}{0pt plus 5cm}T\+E\+S\+T\+\_\+\+F (
\begin{DoxyParamCaption}
\item[{{\bf Min\+Queue\+Test}}]{, }
\item[{test\+\_\+insert}]{}
\end{DoxyParamCaption}
)}\label{minqueue__test_8h_ad8f979c4a970d6da46dce5fc51ad9be0}


\hyperlink{class_min_queue_test}{Min\+Queue\+Test}\+:测试最小优先级队列 

{\ttfamily test\+\_\+insert}：测试{\ttfamily insert(...)}成员方法 

Definition at line 92 of file minqueue\+\_\+test.\+h.

\hypertarget{minqueue__test_8h_abb112e00f9190db01bd4a0f1b5b0a614}{}\index{minqueue\+\_\+test.\+h@{minqueue\+\_\+test.\+h}!T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}}
\index{T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}!minqueue\+\_\+test.\+h@{minqueue\+\_\+test.\+h}}
\subsubsection[{T\+E\+S\+T\+\_\+\+F(\+Min\+Queue\+Test, test\+\_\+is\+\_\+empty)}]{\setlength{\rightskip}{0pt plus 5cm}T\+E\+S\+T\+\_\+\+F (
\begin{DoxyParamCaption}
\item[{{\bf Min\+Queue\+Test}}]{, }
\item[{test\+\_\+is\+\_\+empty}]{}
\end{DoxyParamCaption}
)}\label{minqueue__test_8h_abb112e00f9190db01bd4a0f1b5b0a614}


\hyperlink{class_min_queue_test}{Min\+Queue\+Test}\+:测试最小优先级队列 

{\ttfamily test\+\_\+is\+\_\+empty}：测试{\ttfamily is\+\_\+empty()}成员方法 

Definition at line 121 of file minqueue\+\_\+test.\+h.

\hypertarget{minqueue__test_8h_a0d1b31cc45a5c0bc93e1af85b15972bb}{}\index{minqueue\+\_\+test.\+h@{minqueue\+\_\+test.\+h}!T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}}
\index{T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}!minqueue\+\_\+test.\+h@{minqueue\+\_\+test.\+h}}
\subsubsection[{T\+E\+S\+T\+\_\+\+F(\+Min\+Queue\+Test, test\+\_\+index\+\_\+inqueue)}]{\setlength{\rightskip}{0pt plus 5cm}T\+E\+S\+T\+\_\+\+F (
\begin{DoxyParamCaption}
\item[{{\bf Min\+Queue\+Test}}]{, }
\item[{test\+\_\+index\+\_\+inqueue}]{}
\end{DoxyParamCaption}
)}\label{minqueue__test_8h_a0d1b31cc45a5c0bc93e1af85b15972bb}


\hyperlink{class_min_queue_test}{Min\+Queue\+Test}\+:测试最小优先级队列 

{\ttfamily test\+\_\+index\+\_\+inqueue}：测试{\ttfamily index\+\_\+inqueue(...)}成员方法 

Definition at line 135 of file minqueue\+\_\+test.\+h.

\hypertarget{minqueue__test_8h_aef5f2ca4ac17ec851b45200adfeb46ec}{}\index{minqueue\+\_\+test.\+h@{minqueue\+\_\+test.\+h}!T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}}
\index{T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}!minqueue\+\_\+test.\+h@{minqueue\+\_\+test.\+h}}
\subsubsection[{T\+E\+S\+T\+\_\+\+F(\+Min\+Queue\+Test, test\+\_\+decreate\+\_\+key)}]{\setlength{\rightskip}{0pt plus 5cm}T\+E\+S\+T\+\_\+\+F (
\begin{DoxyParamCaption}
\item[{{\bf Min\+Queue\+Test}}]{, }
\item[{test\+\_\+decreate\+\_\+key}]{}
\end{DoxyParamCaption}
)}\label{minqueue__test_8h_aef5f2ca4ac17ec851b45200adfeb46ec}


\hyperlink{class_min_queue_test}{Min\+Queue\+Test}\+:测试最小优先级队列 

{\ttfamily test\+\_\+decreate\+\_\+key}：测试{\ttfamily decreate\+\_\+key(...)}成员方法。当{\ttfamily test\+\_\+insert}测试通过时隐含着{\ttfamily test\+\_\+decreate\+\_\+key}测试通过 

Definition at line 164 of file minqueue\+\_\+test.\+h.

\hypertarget{minqueue__test_8h_a06d0f0b537e5e33c402fd59bdc22a40e}{}\index{minqueue\+\_\+test.\+h@{minqueue\+\_\+test.\+h}!T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}}
\index{T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}!minqueue\+\_\+test.\+h@{minqueue\+\_\+test.\+h}}
\subsubsection[{T\+E\+S\+T\+\_\+\+F(\+Min\+Queue\+Test, test\+\_\+setup\+Heap)}]{\setlength{\rightskip}{0pt plus 5cm}T\+E\+S\+T\+\_\+\+F (
\begin{DoxyParamCaption}
\item[{{\bf Min\+Queue\+Test}}]{, }
\item[{test\+\_\+setup\+Heap}]{}
\end{DoxyParamCaption}
)}\label{minqueue__test_8h_a06d0f0b537e5e33c402fd59bdc22a40e}


\hyperlink{class_min_queue_test}{Min\+Queue\+Test}\+:测试最小优先级队列 

{\ttfamily test\+\_\+setup\+Heap}：测试{\ttfamily setup\+Heap()}成员方法。该接口是堆排序中最大堆的遗留方法，因此这里不再测试 

Definition at line 173 of file minqueue\+\_\+test.\+h.

\hypertarget{minqueue__test_8h_a90ff801f1417c5ee3336bb73ded2f7f2}{}\index{minqueue\+\_\+test.\+h@{minqueue\+\_\+test.\+h}!T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}}
\index{T\+E\+S\+T\+\_\+\+F@{T\+E\+S\+T\+\_\+\+F}!minqueue\+\_\+test.\+h@{minqueue\+\_\+test.\+h}}
\subsubsection[{T\+E\+S\+T\+\_\+\+F(\+Min\+Queue\+Test, test\+\_\+heapify)}]{\setlength{\rightskip}{0pt plus 5cm}T\+E\+S\+T\+\_\+\+F (
\begin{DoxyParamCaption}
\item[{{\bf Min\+Queue\+Test}}]{, }
\item[{test\+\_\+heapify}]{}
\end{DoxyParamCaption}
)}\label{minqueue__test_8h_a90ff801f1417c5ee3336bb73ded2f7f2}


\hyperlink{class_min_queue_test}{Min\+Queue\+Test}\+:测试最小优先级队列 

{\ttfamily test\+\_\+heapify}：测试{\ttfamily heapify(...)}成员方法。当{\ttfamily extract\+\_\+min}测试通过时隐含着{\ttfamily test\+\_\+heapify}测试通过 

Definition at line 182 of file minqueue\+\_\+test.\+h.

